Quiescence Search for Stratego
نویسندگان
چکیده
This article analyses quiescence search in an imperfect-information game, Stratego. We point out that there are two key problems. The first problem is the search overhead, and the second problem is the limited information gain. A possible solution to the first and second problem is an Evaluation-Based Quiescence Search (EBQS). Experiments show that this solution improves the playing strength of a Stratego program.
منابع مشابه
XT Capita Selecta
XT is a bundle of program-transformation tools. Stratego is part of this bundle, and is used as implementation language for many tools throughout its packages. Giving special attention to the role of Stratego, we discuss a selection of our XT experiences. These range from the construction of meta-tools to support Stratego programming, through Stratego techniques applied in constructing some of ...
متن کاملProgram Transformation with Stratego/XT: Rules, Strategies, Tools, and Systems in Stratego/XT 0.9
Stratego/XT is a framework for the development of transformation systems aiming to support a wide range of program transformations. The framework consists of the transformation language Stratego and the XT collection of transformation tools. Stratego is based on the paradigm of rewriting under the control of programmable rewriting strategies. The XT tools provide facilities for the infrastructu...
متن کاملOpponent Modeling in Stratego
Stratego is a game of imperfect information, where observations of the opponent’s behaviour are crucial for determining the best move. This paper describes how one can model the opponent in the game of Stratego, using a Bayesian approach. By observing the moves of the opponent, a probability distribution can be derived to help determine the identity of unknown pieces of the opponent. Experiment...
متن کاملStratego/XT 0.17. A language and toolset for program transformation
Stratego/XT is a language and toolset for program transformation. The Stratego language provides rewrite rules for expressing basic transformations, programmable rewriting strategies for controlling the application of rules, concrete syntax for expressing the patterns of rules in the syntax of the object language, and dynamic rewrite rules for expressing context-sensitive transformations, thus ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009